A new algorithm to fit exponential decays without initial Guess
نویسندگان
چکیده
منابع مشابه
Fast Registration of 3D Laser Scans without Initial Guess
State of the art graph-based 3D SLAM systems are typically divided into the so-called frontand backend. The frontend’s task is to align laser scans locally, constructing a graph of the measurements in the process. The backend’s task is to optimize this graph in order to find a maximally consistent configuration of the nodes. The well-known ICP algorithm is often used to align pairs of laser sca...
متن کاملEstimating a density by adapting an initial guess
De Bruin et al. (Comput. Statist. Data Anal. 30 (1999) 19) provide a unique method to estimate the probability density f from a sample, given an initial guess of f. An advantage of their estimate fn is that an approximate standard error can be provided. A disadvantage is that fn is less accurate, on the average, than more usual kernel estimates. The reason is that fn is not su4ciently smooth. A...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولA new fast track-fit algorithm based on broken lines
The determination of the particle momentum in HEP tracking chambers requires a fit of a parametrization to the measured points. Various effects can result in deviations to the ideal helix curve in the magnetic field of a solenoid, and the fit with a pure helix parametrization is not optimal. One effect is multiple scattering, which causes a “random walk” of the particle and affects especially l...
متن کاملA New Backpropagation Algorithm without Gradient Descent
The backpropagation algorithm, which had been originally introduced in the 1970s, is the workhorse of learning in neural networks. This backpropagation algorithm makes use of the famous machine learning algorithm known as Gradient Descent, which is a first-order iterative optimization algorithm for finding the minimum of a function. To find a local minimum of a function using gradient descent, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2018
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1812233t